Lecture 2 / 11 : Satisfiability Modulo Theories , Part I
نویسندگان
چکیده
Satisfiability modulo theories (SMT) is the study of the satisfiability of logical formulas (typically in first-order logic) with respect to (combinations of) background theories. The roots of SMT go back to work on automatic theorem proving and decision procedures for such logics performed in the 1970s and 80s. The defining characteristic of SMT solvers is their mode of operation: a satisfiability-preserving, explicit or implicit encoding of the original formula into a Boolean satisfiability (SAT) formula.
منابع مشابه
Lecture Notes in Computer Science 7385
In the last decade, advances in satisfiability-modulo-theories (SMT) solvers have powered a new generation of software tools for verification and testing. These tools transform various program analysis problems into the problem of satisfiability of formulas in propositional or first-order logic, where they are discharged by SMT solvers, such as Z3 from Microsoft Research. This paper briefly sum...
متن کاملThe SMT-LIB Format: An Initial Proposal
This paper is a first proposal for a common format for the Satisfiability Modulo Theories Library, or SMT-LIB for short. The main goal of the SMT-LIB initiative [2], coordinated by these authors and supported by a growing number of researchers world-wide, is to produce a on-line library of benchmarks for satisfiability modulo theories. By benchmark we mean a logical formula to be checked for sa...
متن کاملInvited talk: Developing Efficient SMT Solvers
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications. Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) of formulas in classical multi-sorted first-order logic with equality, with respect to a background theory. The success of SMT for ve...
متن کامل1 Tractability and Modern Satisfiability Modulo
1 Tractability and Modern Satisfiability Modulo Theories Solvers page 3 1.
متن کاملSMT-COMP: Satisfiability Modulo Theories Competition
Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2, 6, 3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT). SMT solvers decide logical satisfiability (or dually, validity) with respect to a background theory in classical first-order logic with equality. Background theories useful for ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015